Symbolic Model-Checking for Abstracting Inevitability Modalities over Transient States
نویسندگان
چکیده
منابع مشابه
Timed Temporal Logics for Abstracting Transient States
In previous work, the timed logic TCTL was extended with an “almost everywhere” Until modality which abstracts negligible sets of positions (i.e. with a null duration) along a run of a timed automaton. We propose here an extension of this logic with more powerful modalities, in order to specify properties abstracting transient states, which are events that last for less than k time units. Our m...
متن کاملSymbolic Model Checking: IO*’ States and Beyond*
Many different methods have been devised for automatically verifying finite state systems by examining state-graph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number of states. We describe a general method that represents the state space symbolical/y instead of explic...
متن کاملModel Checking Gossip Modalities
We present a model checking technique for LCSA, a temporal logic for communicating sequential agents (CSAs) introduced by Lodaya, Ramanujam, and Thiagarajan. LCSA contains temporal modalities indexed with a local point of view of one agent and allows to refer to properties of other agents according to the latest gossip which is related to local knowledge. The model checking procedure relies on ...
متن کاملSymbolic Model Checking: 10^20 States and Beyond
Many diierent methods have been devised for automatically verifying nite state systems by examining state-graph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number of states. We describe a general method that represents the state space symbolically instead of explicitl...
متن کاملSymbolic Model Checking with Sets of States Represented as Formulas
We analyse traditional symbolic model checking BCL + 94] to isolate the operations that a representation for sets of states need to support and present a diierent view, where sets of states are represented by propositional logic formulas. High level algorithms for symbolic model checking based on St almarck's method are then presented, which results in a model checking procedure closely related...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Control and Automation
سال: 2017
ISSN: 2005-4297,2005-4297
DOI: 10.14257/ijca.2017.10.12.04